基于信息溢出网络的我国行业关联性研究

行业信息溢出网络是各行业之间风险关联的载体,其信息溢出的方向和强度与行业的风险传染特征密切相关。运用广义方差分解对申银万国行业一级指数同时构建行业收益率溢出网络和行业波动率溢出网络,分别从静态和动态角度分析我国行业信息溢出的总体情况和动态演化。研究发现:我国各行业间信息溢出水平较高,整体信息联动能力强,但各行业信息溢出随时间变化具有波动性和不确定性。长期情形下,收益率溢出网络和波动溢出网络对系统性重要行业的识别排序具有高度一致性,但短期内两者存在较大差异。长期内,银行业和非银行金融业是系统性重要(信息)接受行业,机械设备业是系统性重要(信息)传播行业;短期内,银行、非银行金融、国防军工、食品饮料及家用电器业是系统性重要行业,但它们的具体角色(信息接受或者传播)具有不确定性。研究结论对于政府产业政策制定及产业监管具有重要的现实意义。     

基于投入产出模型的高技术制造业产业链区域间协同研究——以鄂湘赣新一代信息技术产业协同为视角

为研究新一代信息技术产业在鄂湘赣的产业链协同发展,本文运用里昂惕夫投入产出模型,首先对新一代信息技术产业的后向(前向)直接、间接关联产业部门分别进行定量化分析,构建新一代信息技术产业的产业链,并得出新一代信息技术产业链的主要关联部门。通过计算Ghosh逆矩阵和Leontief逆矩阵的平均值矩阵F,测度鄂湘赣地区产业链主要关联部门间的成本推动效应和需求拉动效应。基于此,运用平均波及步数法测度鄂湘赣3省之间新一代信息技术产业链的关联程度,最终得出鄂湘赣3省新一代信息技术产业基于产业链进行协同发展的对策建议。     

Designing robust liner shipping schedules: Optimizing recovery actions and buffer times

It is important for liner shipping companies to maintain cost efficient and robust liner shipping networks. Regularly, they set up pro-forma schedules, yet it is difficult to stay on time. We consider the problem of managing the delays. Therefore, we need to determine an optimal recovery policy and buffer time allocation to the ship route in order to minimize the total costs associated with delays and recovery actions, such as increasing sailing speed. We introduce a general framework consisting of a mixed integer programming formulation to solve discrete stochastic decision problems with short and long term decisions and apply this framework to the above described problem. Furthermore, we propose and test four heuristics for this problem. We compared the results of our method with an existing liner shipping route schedule and found a cost decrease of 28.9% after optimizing the buffer time distribution compared to the cost of sailing the current route schedule at constant speed.     

探索战略性新兴产业发展模式,推动纳米技术应用产业发展

作为开展纳米科技研究较早、论文专利成果显著的纳米科技大国,我国的纳米技术产业化发展明显滞后,尚未形成纳米技术的＂产业＂共识.苏州是国内第一个把纳米技术产业作为引领转型升级的战略性新兴产业的区域,这一战略选择得到了国家、中国科学院和江苏省的高度支持.战略性新兴产业发展需要＂顶层设计、系统规划＂.苏州借鉴国际经验,结合国情和区域实际,提出构建纳米技术产业生态圈,按照产业发展需求规划布局和整合产业资源要素,形成有效互动的产业发展模式,得到国内外纳米技术科技界、产业界和政府部门的普遍认同.     

移动实验室行业发展探讨

移动实验室以其高移动性、现场快速检测的优势弥补了固定实验室在应对公共安全问题上的局限。移动实验室行业在政策、技术、应用、生产等方面存在不少问题,发展受到限制。解决移动实验室发展问题的关键是加强同移动实验室相关的各机构部门之间的沟通,因此有必要建立促进各机构部门良好沟通、协同发展的平台——移动实验室行业协会。移动实验室协会应选择体制内外相结合的方式组建,建立完善的体系和功能,塑造良好的形象。     

基于水足迹的嘉兴市农业产业结构优化模型

农业产业结构是决定农业用水效率的重要因素之一。相较于传统用水评价,基于水足迹的评价能更全面地反映水资源的过程消耗。在对嘉兴市农业蓝水、绿水及灰水足迹核算基础上,用农业水资源压力指数（AWSI）评估区域农业用水压力,构建了基于水足迹的农业产业结构优化模型,分析了节水型、均衡型和发展型3种农业产业结构调整情景。结果表明,嘉兴市农业水足迹以绿水为主,蓝水足迹、绿水足迹和灰水足迹的占比分别为11.6%,51.7%和36.8%,AWSI为0.45,存在较高的水资源压力;通过调整产业结构,3种目标情景下的农业水足迹及经济效益均实现了不同程度优化,AWSI分别降低4.54%,3.89%和0.74%,有效减轻区域水资源压力。研究表明,通过基于水足迹的农业产业结构调整,有效提高了区域集约化用水效率,减轻了用水压力。研究可为农业水资源管理决策提供参考。     

On the growth of primary industry and population of China’s counties

The growth dynamics of complex organizations have attracted much interest of econophysicists and sociophysicists in recent years. However, most of the studies are done for developed countries. We investigate the growth dynamics of the primary industry and the population of 2079 counties in mainland China using the data from the China County Statistical Yearbooks from 2000 to 2006. We find that the annual growth rates are distributed according to Student’s t distribution with the tail exponent less than 2. We find power-law relationships between the sample standard deviation of the growth rates and the initial size. The scaling exponent is less than 0.5 for the primary industry and close to 0.5 for the population.     

成都市信息技术产业的计量经济模型

本文针对成都市信息技术产业的实际情况,依据市电子工业局提供的数据建立了成都市信息技术产业的计量经济模型．该模型由８ 个方程组成,包含８ 个内生变量和１２ 个外生变量．根据模型的方程体系,对成都市现有的电子信息产业结构进行分析,揭示了市电子工业总产出的影响因素,提出了该行业结构优化的建议方案,并给出了一个可行的预测方程;分部类排序结果表明成都市信息技术产业化仍停留在分立元器件基础阶段,产业发展水平亟待提高     

整合旅游资源,实现旅游业的新发展

利用主成分因子分析法定量分析浙江省及其5个相邻省份旅游业的综合情况,通过比较找出浙江旅游的优势和劣势,并指出,浙江应加强与相邻各省市旅游资源的整合,加强旅游业的规模经营,实现功能互补,效益最大．     

Brooks-type theorems for choosability with separation

We consider the following type of problems. Given a graph G = (V, E) and lists L(v) of allowed colors for its vertices v ∈ V such that |L(v)| = p for all v ∈ V and |L(u) ∩ L(v)| ≤ c for all uv ∈ E, is it possible to find a “list coloring,” i.e., a color f(v) ∈ L(v) for each v ∈ V, so that f(u) ≠ f(v) for all uv ∈ E? We prove that every of maximum degree Δ admits a list coloring for every such list assignment, provided p ≥ . Apart from a multiplicative constant, the result is tight, as lists of length may be necessary. Moreover, for G = K_n (the complete graph on n vertices) and c = 1 (i.e., almost disjoint lists), the smallest value of p is shown to have asymptotics (1 + o(1)) . For planar graphs and c = 1, lists of length 4 suffice. ˜© 1998 John Wiley & Sons, Inc. J Graph Theory 27: 43–49, 1998